on spectra of unitary cayley mixed graph

Authors

chandrashekar adiga

b‎. ‎r‎. ‎rakshith

abstract

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Color energy of a unitary Cayley graph

Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the co...

full text

On the Unitary Cayley Graph of a Ring

Let R be a ring with identity. The unitary Cayley graph of a ring R, denoted by GR, is the graph, whose vertex set is R, and in which {x, y} is an edge if and only if x − y is a unit of R. In this paper we find chromatic, clique and independence number of GR, where R is a finite ring. Also, we prove that if GR ' GS , then GR/JR ' GS/JS , where JR and JS are Jacobson radicals of R and S, respect...

full text

On the Unitary Cayley Graph of a Finite Ring

We study the unitary Cayley graph associated to an arbitrary finite ring, determining precisely its diameter, girth, eigenvalues, vertex and edge connectivity, and vertex and edge chromatic number. We also compute its automorphism group, settling a question of Klotz and Sander. In addition, we classify all planar graphs and perfect graphs within this class.

full text

On Unitary Cayley Graphs

AssrRAcr. We deal with a family of undirected Cayley graphs X. which are unions of disjoint Hamilton cycles, and some of their properties, where rz runs over the positive integers. It is proved that X-is a bipartite graph when n is even. If n is an odd number, we count the number of different colored triangles in Xn.

full text

Super edge-connectivity of mixed Cayley graph

A graph X is max-λ if λ(X) = δ(X). A graph X is super-λ if X is max-λ and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-λ and super-λ. c © 2008 Elsevier B.V. All rights reserved.

full text

SOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

full text

My Resources

Save resource for easier access later


Journal title:
transactions on combinatorics

Publisher: university of isfahan

ISSN 2251-8657

volume 5

issue 2 2016

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023